Heuristic Backbone Sampling for Maximum Satis ability
نویسندگان
چکیده
The weighted maximum satis ability (MAXSAT) problem is of great interest to the Arti cial Intelligence community, as a model for several constraint satisfaction problems (emerging e.g. from planning) which require that an optimum subset of their constraints be satis ed. Recent research on satis ability (SAT) problems has reached interesting conclusions regarding their hardness. In this paper, we introduce an algorithm designed in a way inspired by these results. Based on the newly introduced concept of the backbone of a formula in conjunctive normal form, we try to sample the most likely values of boolean variables through an iterative process. Experiments conducted on appropriate unsatis able SAT instances show that the algorithm converges to a near optimum subset of satis ed disjunctive clauses. Evidence of remarkable success on weighted MAXSAT instances is also presented and discussed.
منابع مشابه
Dynamic Constrained Traffic Engineering for Multicast Routing
This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwidth c...
متن کاملExplicit multicast routing algorithms for constrained traffic engineering
|This paper presents a new traÆc engineering technique for dynamic constrained multicast routing, where the routing request of traÆc arrives one-by-one. The objective we adopted in this paper is to minimize the maximum of link utilization. Although this traÆc engineering is useful to relax the most heavily congested link in Internet backbone, the total network resources, i.e. sum of link bandwi...
متن کاملBackbone Fragility Causes the Local Search Cost Peak
The local search algorithm Wsat is one of the most successful algorithms for solving the satis ability (SAT) problem. It is notably e ective at solving hard Random 3-SAT instances near the so-called `satis ability threshold', but still shows a peak in search cost near the threshold and large variations in cost over di erent instances. We make a number of signi cant contributions to the analysis...
متن کاملDetecting Embedded Horn Structure in Propositional Logic
We show that the problem of nding a maximum renamable Horn problem within a propositional satis ability problem is NP hard but can be formulated as a set packing and therefore a maximum clique problem for which numerous algorithms and heuristics have been developed
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002